Distance transitive graphs with symmetric or alternating automorphism group
نویسندگان
چکیده
منابع مشابه
Distance Transitive Graphs with Symmetric or Alternating Automorphism Group
for some n , acting primitively on the set of vertices. This forms a part of the programme for the classification of all finite primitive distance transitive graphs begun in [76]; for in [76] this classification is reduced to the determination of all such graphs whose automorphism group G is either almost simple (that is, T o f f S Aut T for some nonabelian simple group T ) or affine (that is, ...
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملSGDs with doubly transitive automorphism group
Symmetric graph designs, or SGDs, were deened by Gronau et al. as a common generalisation of symmetric BIBDs and orthogonal double covers. This note gives a classiication of SGDs admitting a 2-transitive automorphism group. There are too many for a complete determination, but in some special cases the determination can be completed, such as those which admit a 3-transitive group, and those with...
متن کاملOn Distance Transitive Graphs in Which the Stabilizer of a Point Contains an Alternating Group
We refer to finite, undirected graphs without loops and multiple edges. A graph r consists of a finite, non-empty set V(I) of vertices and a set E(I) of edges, each of which is an unordered pair of distinct vertices. Two vertices joined by an edge are said to be adjacent. A path of length n in T, sayan n-path, is a sequence of n + 1 vertices {uo, Ul"'" un}, where u, E V(I) (0 ~ i ~ n), (U;-l' u...
متن کاملBiplanes with flag-transitive automorphism groups of almost simple type, with alternating or sporadic socle
In this paper we prove that there cannot be a biplane admitting a primitive, flagtransitive automorphism group of almost simple type, with alternating or sporadic socle.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1987
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700012995